Correlations in random Apollonian network
نویسندگان
چکیده
منابع مشابه
Correlations in random Apollonian network
In this paper, by both simulations and theoretical predictions we study two and three node (or degree) correlations in random Apollonian network (RAN), which have small-world and scale-free topologies. Using the rate equation approach under the assumption of continuous degree, we first give the analytical solution for two node correlations, expressed by average nearest-neighbor degree (ANND). T...
متن کاملDistances in random Apollonian network structures†
In this paper, we study the distribution of distances in random Apollonian network structures (RANS), a family of graphs which has a one-to-one correspondence with planar ternary trees. Using multivariate generating functions that express all information on distances, and singularity analysis for evaluating the coefficients of these functions, we prove a Rayleigh limit distribution for distance...
متن کاملOn longest paths and diameter in random apollonian network
We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at random, add a vertex inside that face and join it to the vertices of the face. After n – 3 steps, we obtain a random triangulated plane graph with n vertices, which is called a Random Apollonian Network (RAN). We show th...
متن کاملRandom walks on the Apollonian network with a single trap
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node with the highest degree), which are simultaneously scale-free and small-world. We obtain the precise analytic expression for the MFPT that is confirmed by dir...
متن کاملParallel Random Apollonian Networks
We present and study in this paper a simple algorithm that produces so called growing Parallel Random Apollonian Networks (P-RAN) in any dimension d. Analytical derivations show that these networks still exhibit small-word and scalefree characteristics. To characterize further the structure of P-RAN, we introduce new parameters that we refer to as the parallel degree and the parallel coefficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2007
ISSN: 0378-4371
DOI: 10.1016/j.physa.2007.02.058